0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : run_E %s %d THM
0.12/0.34	% Computer : n013.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1440
0.12/0.34	% WCLimit    : 180
0.12/0.34	% DateTime   : Thu Jul  4 06:10:54 EDT 2024
0.12/0.34	% CPUTime    : 
0.20/0.48	Running higher-order theorem proving
0.20/0.49	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.qmwh9wTrox/E---3.1_23738.p
0.20/0.50	# Version: 3.2.0-ho
0.20/0.50	# Preprocessing class: HSMSSMSSSSSNFFN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting new_ho_10 with 900s (5) cores
0.20/0.50	# Starting new_bool_1 with 180s (1) cores
0.20/0.50	# Starting full_lambda_5 with 180s (1) cores
0.20/0.50	# Starting new_ho_10_unif with 180s (1) cores
0.20/0.50	# new_bool_1 with pid 23820 completed with status 0
0.20/0.50	# Result found by new_bool_1
0.20/0.50	# Preprocessing class: HSMSSMSSSSSNFFN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting new_ho_10 with 900s (5) cores
0.20/0.50	# Starting new_bool_1 with 180s (1) cores
0.20/0.50	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.20/0.50	# Search class: HHUNF-FFSF22-SFFFFFNN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.50	# Starting new_ho_10 with 98s (1) cores
0.20/0.50	# new_ho_10 with pid 23824 completed with status 0
0.20/0.50	# Result found by new_ho_10
0.20/0.50	# Preprocessing class: HSMSSMSSSSSNFFN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting new_ho_10 with 900s (5) cores
0.20/0.50	# Starting new_bool_1 with 180s (1) cores
0.20/0.50	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.20/0.50	# Search class: HHUNF-FFSF22-SFFFFFNN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.50	# Starting new_ho_10 with 98s (1) cores
0.20/0.50	# Preprocessing time       : 0.001 s
0.20/0.50	# Presaturation interreduction done
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(decl_sort1, type, frac: $tType).
0.20/0.50	thf(decl_22, type, x: frac).
0.20/0.50	thf(decl_23, type, y: frac).
0.20/0.50	thf(decl_24, type, z: frac).
0.20/0.50	thf(decl_25, type, u: frac).
0.20/0.50	thf(decl_26, type, eq: frac > frac > $o).
0.20/0.50	thf(decl_27, type, moref: frac > frac > $o).
0.20/0.50	thf(decl_28, type, pf: frac > frac > frac).
0.20/0.50	thf(satz44, axiom, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((moref @ X1 @ X2)=>((eq @ X1 @ X3)=>((moref @ X3 @ X4)<=(eq @ X2 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.qmwh9wTrox/E---3.1_23738.p', satz44)).
0.20/0.50	thf(satz58, axiom, ![X1:frac, X2:frac]:((eq @ (pf @ X1 @ X2) @ (pf @ X2 @ X1))), file('/export/starexec/sandbox2/tmp/tmp.qmwh9wTrox/E---3.1_23738.p', satz58)).
0.20/0.50	thf(satz62g, axiom, ![X1:frac, X2:frac, X3:frac, X4:frac]:((((moref @ X3 @ X4)=>(moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X4)))<=(eq @ X1 @ X2))), file('/export/starexec/sandbox2/tmp/tmp.qmwh9wTrox/E---3.1_23738.p', satz62g)).
0.20/0.50	thf(satz62h, conjecture, (moref @ (pf @ z @ x) @ (pf @ u @ y)), file('/export/starexec/sandbox2/tmp/tmp.qmwh9wTrox/E---3.1_23738.p', satz62h)).
0.20/0.50	thf(e, axiom, (eq @ x @ y), file('/export/starexec/sandbox2/tmp/tmp.qmwh9wTrox/E---3.1_23738.p', e)).
0.20/0.50	thf(m, axiom, (moref @ z @ u), file('/export/starexec/sandbox2/tmp/tmp.qmwh9wTrox/E---3.1_23738.p', m)).
0.20/0.50	thf(c_0_6, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((moref @ X1 @ X2)=>((eq @ X1 @ X3)=>((eq @ X2 @ X4)=>(moref @ X3 @ X4))))), inference(fof_simplification,[status(thm)],[satz44])).
0.20/0.50	thf(c_0_7, plain, ![X15:frac, X16:frac, X17:frac, X18:frac]:((~(moref @ X15 @ X16)|(~(eq @ X15 @ X17)|(~(eq @ X16 @ X18)|(moref @ X17 @ X18))))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
0.20/0.50	thf(c_0_8, plain, ![X23:frac, X24:frac]:((eq @ (pf @ X23 @ X24) @ (pf @ X24 @ X23))), inference(variable_rename,[status(thm)],[satz58])).
0.20/0.50	thf(c_0_9, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((eq @ X1 @ X2)=>((moref @ X3 @ X4)=>(moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X4))))), inference(fof_simplification,[status(thm)],[satz62g])).
0.20/0.50	thf(c_0_10, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((moref @ X3 @ X4)|~((moref @ X1 @ X2))|~((eq @ X1 @ X3))|~((eq @ X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.50	thf(c_0_11, plain, ![X2:frac, X1:frac]:((eq @ (pf @ X1 @ X2) @ (pf @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.50	thf(c_0_12, plain, ![X19:frac, X20:frac, X21:frac, X22:frac]:((~(eq @ X19 @ X20)|(~(moref @ X21 @ X22)|(moref @ (pf @ X19 @ X21) @ (pf @ X20 @ X22))))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
0.20/0.50	thf(c_0_13, negated_conjecture, ~(moref @ (pf @ z @ x) @ (pf @ u @ y)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz62h])])).
0.20/0.50	thf(c_0_14, plain, ![X2:frac, X4:frac, X3:frac, X1:frac]:(((moref @ X1 @ (pf @ X2 @ X3))|~((moref @ X4 @ (pf @ X3 @ X2)))|~((eq @ X4 @ X1)))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
0.20/0.50	thf(c_0_15, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X4))|~((eq @ X1 @ X2))|~((moref @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.20/0.50	thf(c_0_16, negated_conjecture, ~(moref @ (pf @ z @ x) @ (pf @ u @ y)), inference(fof_nnf,[status(thm)],[c_0_13])).
0.20/0.50	thf(c_0_17, plain, ![X1:frac, X3:frac, X5:frac, X4:frac, X2:frac]:(((moref @ X1 @ (pf @ X2 @ X3))|~((eq @ (pf @ X4 @ X5) @ X1))|~((eq @ X4 @ X3))|~((moref @ X5 @ X2)))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.20/0.50	thf(c_0_18, negated_conjecture, ~((moref @ (pf @ z @ x) @ (pf @ u @ y))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.50	thf(c_0_19, plain, ![X2:frac, X1:frac, X4:frac, X3:frac]:(((moref @ (pf @ X1 @ X2) @ (pf @ X3 @ X4))|~((eq @ X2 @ X4))|~((moref @ X1 @ X3)))), inference(spm,[status(thm)],[c_0_17, c_0_11])).
0.20/0.50	thf(c_0_20, plain, (eq @ x @ y), inference(split_conjunct,[status(thm)],[e])).
0.20/0.50	thf(c_0_21, plain, (moref @ z @ u), inference(split_conjunct,[status(thm)],[m])).
0.20/0.50	thf(c_0_22, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20]), c_0_21])]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Parsed axioms                        : 14
0.20/0.50	# Removed by relevancy pruning/SinE    : 8
0.20/0.50	# Initial clauses                      : 6
0.20/0.50	# Removed in clause preprocessing      : 0
0.20/0.50	# Initial clauses in saturation        : 6
0.20/0.50	# Processed clauses                    : 19
0.20/0.50	# ...of these trivial                  : 0
0.20/0.50	# ...subsumed                          : 0
0.20/0.50	# ...remaining for further processing  : 19
0.20/0.50	# Other redundant clauses eliminated   : 0
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 0
0.20/0.50	# Backward-rewritten                   : 0
0.20/0.50	# Generated clauses                    : 9
0.20/0.50	# ...of the previous two non-redundant : 8
0.20/0.50	# ...aggressively subsumed             : 0
0.20/0.50	# Contextual simplify-reflections      : 0
0.20/0.50	# Paramodulations                      : 9
0.20/0.50	# Factorizations                       : 0
0.20/0.50	# NegExts                              : 0
0.20/0.50	# Equation resolutions                 : 0
0.20/0.50	# Disequality decompositions           : 0
0.20/0.50	# Total rewrite steps                  : 2
0.20/0.50	# ...of those cached                   : 0
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 13
0.20/0.50	#    Positive orientable unit clauses  : 3
0.20/0.50	#    Positive unorientable unit clauses: 0
0.20/0.50	#    Negative unit clauses             : 1
0.20/0.50	#    Non-unit-clauses                  : 9
0.20/0.50	# Current number of unprocessed clauses: 0
0.20/0.50	# ...number of literals in the above   : 0
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 6
0.20/0.50	# Clause-clause subsumption calls (NU) : 8
0.20/0.50	# Rec. Clause-clause subsumption calls : 5
0.20/0.50	# Non-unit clause-clause subsumptions  : 0
0.20/0.50	# Unit Clause-clause subsumption calls : 0
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 0
0.20/0.50	# BW rewrite match successes           : 0
0.20/0.50	# Condensation attempts                : 19
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 712
0.20/0.50	# Search garbage collected termcells   : 92
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.003 s
0.20/0.50	# System time              : 0.003 s
0.20/0.50	# Total time               : 0.006 s
0.20/0.50	# Maximum resident set size: 1792 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.003 s
0.20/0.50	# System time              : 0.006 s
0.20/0.50	# Total time               : 0.009 s
0.20/0.50	# Maximum resident set size: 1716 pages
0.20/0.50	% E---3.1 exiting
0.20/0.51	% E exiting
0.20/0.51	EOF